Program products for pacing the frequency at which systems of a multisystem environment compress log streams

ABSTRACT

The frequency at which a multisystem log stream is compressed by a system of a multisystem environment is adjusted in real-time. The rate at which the multisystem log stream is compressed by the system is ascertained. That rate is relative to how frequently the multisystem log stream is compressed by other systems of the multisystem environment. The frequency with which the system compresses the multisystem log stream is then adjusted in real-time. Thus, the frequency at which one system of the multisystem environment compresses the log stream is relative to the frequency at which other systems of the multisystem environment are compressing the log stream.

TECHNICAL FIELD

This invention relates, in general, to the management of log streams ofa multisystem environment and, in particular, to pacing the frequency atwhich the log streams are compressed by systems of the multisystemenvironment.

CROSS REFERENCE TO RELATED APPLICATIONS

This application contains subject matter which is related to the subjectmatter of the following applications, each of which is assigned to thesame assignee as this application, and each of which is herebyincorporated herein by reference in its entirety:

“Method Of Pacing The Frequency At Which Systems Of A MultisystemEnvironment Compress Log Streams,” by Geiner et al., Ser. No.09/262,250, filed herewith;

“Pacing The Frequency At Which Systems Of A Multisystem EnvironmentCompress Log Streams,” by Geiner et al., Ser. No. 09/262,587, filedherewith;

“Tail Compression Of A Sparse Log Stream Of A Computer System,” by Clarket al., U.S. Pat. No. 5,920,875, filed on Mar. 28, 1997;

“Tail Compression Of A Log Stream Using A Scratch Pad Of LogicallyDeleted Entries,” by Clark et al., U.S. Pat. No. 5,966,708, filed onMar. 28, 1997;

“System Of Compressing A Log Stream Using A Scratch Pad Of LogicallyDeleted Entries,” by Clark et al., U.S. Pat. No. 6,108,667, filed onMar. 28, 1997;

“A Method of One System Of A Multisystem Environment Taking Over LogEntries Owned By Another System,” by Clark et al., U.S. Pat. No.,076,095, filed on Mar. 28, 1997;

“One System Of A Multisystem Environment Taking Over Log Entries OwnedBy Another System,” by Clark et al., U.S. Pat. No. 6,092,084, filed onMar. 28, 1997;

“System Of Compressing The Tail Of a Sparse Log Stream Of A MultisystemEnvironment,” by Clark et al., U.S. Pat. No. 6,125,393, filed on Mar.28, 1997;

“System Of Compressing The Tail Of A Sparse Log Stream Of A ComputerSystem,” by Clark et al., U.S. Pat. No. 5,956,735, filed on Mar. 28,1997;

“Tail Compression Of A Sparse Log Stream Of A Multisystem Environment,”by Clark et al., U.S. Pat. No. 5,999,935, filed on Mar. 28, 1997; and

“Method And System For Log Management In A Coupled Data ProcessingSystem,” by Geiner et al., U.S. Pat. No. 5,737,600, issued on Apr. 7,1998.

BACKGROUND ART

In various computer systems, historical log data is maintained in, forinstance, log files for use in system recovery, problem determinationand/or system maintenance. Typically, these log files have a limitedamount of capacity to retain the historical data. After the capacity ismet, at least some of the data records are moved from the log files toexternal storage devices, such as direct access storage devices (DASD),thereby providing additional space in the log files for more data.

At some point, data within the log files and/or on the external storagedevices is no longer needed. For example, there is no need to keep thedata once it passes its retention requirements. The saving of data pastits usefulness adversely affects system performance in a number of ways.For instance, when unnecessary data is retained and a log file needs tobe browsed to recover logged data during recovery of a failure, thebrowser may have to deal with potentially large amounts of unnecessarydata, thereby slowing down the recovery process. Additionally, when thesaving of unwanted data records requires the use of external storagedevices, which typically provide slower access to the data, the readingof the data takes longer, thus, affecting system performance.

Therefore, it is beneficial to delete any unnecessary data from the logfiles. This is accomplished by compressing the log files and thenphysically deleting any entries that can be deleted. When a log file isused by various systems of a multisystem environment, each of thesystems is responsible for compressing and deleting its unwantedentries.

When the systems of the multisystem environment are processing atdifferent transaction rates, however, and the slower system does notadequately compress the log file at a rate commensurate with the fastersystem, the slower system adversely affects the performance of thefaster system. This is true regardless of whether the reason for thedisparity in transaction rates is hardware performance characteristicsor work load differences. Thus, the faster system potentially has manymore elements in the log file than the slower system, and the elementsof the faster system can be separated by a single element written by theslower system. This problem may be exacerbated when there are severalfast systems and only one slow system.

Based on the foregoing, a need exists for a capability that provides forthe pacing of the frequency at which a system compresses a multisystemlog file. A further need exists for a capability that allows each systemto adjust its compression rate based on the compression rates of theother systems, thus ensuring a minimal sized log file. A further needexists for a pacing technique that allows the frequency of compressionto be adjusted in real-time based on the current transaction rates ofthe systems connected to the log file.

SUMMARY OF THE INVENTION

The shortcomings of the prior art are overcome and additional advantagesare provided through the provision of an article of manufactureincluding at least one computer usable medium having computer readableprogram code means embodied therein for causing the pacing of thefrequency at which multisystem log streams are compressed. The computerreadable program code means in the article of manufacture includes, forinstance, computer readable program code means for causing a computer toascertain a rate at which a multisystem log stream is compressed by onesystem of a multisystem environment. The rate is relative to howfrequently the multisystem log stream is compressed by at least oneother system of the multisystem environment. The article of manufacturefurther includes computer readable program code means for causing acomputer to adjust, in real-time, the frequency at which the one systemcompresses the multisystem log stream.

In one example, the computer readable program code means for causing acomputer to ascertain includes computer readable program means forcausing a computer to check a compress lag count of the one system. In afurther example, the article of manufacture includes computer readableprogram code means for causing a computer to update the compress lagcount when the one system compresses the multisystem log stream.

In another embodiment of the invention, the computer readable programcode means for causing a computer to adjust includes computer readableprogram code means for causing a computer to increase the frequency atwhich the one system compresses the multisystem log stream, when theascertained rate indicates that the one system is compressing themultisystem log stream at a slower rate than at least one other system.

In another embodiment of the invention, at least one program storagedevice readable by a machine, tangibly embodying at least one program ofinstructions executable by the machine to perform a method of pacing thefrequency at which multisystem log streams are compressed, is provided.The method includes, for instance, ascertaining a rate at which amultisystem log stream is compressed by one system of a multisystemenvironment; comparing, at predefined time intervals, the ascertainedrate to a predefined value to determine whether the frequency at whichthe one system compresses the multisystem log stream is to be adjusted;adjusting, in real-time, the frequency at which one system compressesthe multisystem log stream, when the comparing indicates adjusting;determining whether the time of the predefined time intervals is to bemodified; and modifying the time of the predefined time intervals toadjust how often the comparing is performed, when it is determined thatthe time is to be modified.

The compression pacing capability of the present inventionadvantageously adjusts, in real-time, the frequency at which systemscompress a multisystem log stream. Each system adjusts its compressionrate based on the compression rates of the other systems, ensuring aminimal sized log stream. This increases the likelihood that the logstream can be contained solely in the coupling facility, and decreasesthe likelihood of degrading system performance caused by off loadingactive data onto external storage devices. The technique of the presentinvention advantageously handles permanent transaction rate differences,such as different processor capacities, as well as temporal changes,like spikes in transaction rates. The log stream compression pacing ofthe present invention is based on heuristics, and the frequency of thecompression is adjusted in real-time based on the current transactionrates (i.e., the writes to the log stream).

Additional features and advantages are realized through the techniquesof the present invention. Other embodiments and aspects of the inventionare described in detail herein and are considered a part of the claimedinvention.

BRIEF DESCRIPTION OF TEE DRAWINGS

The subject matter which is regarded as the invention is particularlypointed out and distinctly claimed in the claims at the conclusion ofthe specification. The foregoing and other objects, features, andadvantages of the invention are apparent from the following detaileddescription taken in conjunction with the accompanying drawings inwhich:

FIG. 1 depicts one example of a multisystem environment incorporatingand using the log stream compression pacing capability of the presentinvention;

FIG. 2 depicts one example of a primary log stream of the multisystemenvironment of FIG. 1, which is managed in accordance with theprinciples of the present invention;

FIG. 3 depicts one embodiment of the logic used in adding new entries tothe primary log stream of FIG. 2;

FIG. 4 depicts one embodiment of a main queue used in accordance withthe principles of the present invention;

FIG. 5 depicts an embodiment of the logic used to logically delete anentry from the primary log stream of FIG. 2, in accordance with theprinciples of the present invention;

FIG. 6 depicts one embodiment of the logic used to compress the primarylog stream of FIG. 2;

FIG. 7a depicts another example of the main queue of FIG. 4 used inaccordance with the principles of the present invention;

FIG. 7b depicts one example of a compression queue used in accordancewith the principles of the present invention;

FIG. 8 depicts another example of the primary log stream of FIG. 2, inwhich the first entry has been rewritten as the seventh entry, inaccordance with the principles of the present invention;

FIG. 9 depicts one embodiment of the logic used to physically removelogically deleted entries from the primary log stream of FIG. 2;

FIGS. 10a and 10 b depict examples of a last entry vector updated duringthe tail deletion of FIG. 9;

FIG. 11a depicts another example of the primary log stream of FIG. 2managed in accordance with the principles of the present invention;

FIGS. 11b-11 c depict other examples of the last entry vector of FIG.10a used in accordance with the principles of the present invention;

FIG. 12 depicts one example of a compression vector used in accordancewith the principles of the present invention;

FIG. 13 depicts one embodiment of the logic used in updating acompression lag count stored in the compression vector of FIG. 12, inaccordance with the principles of the present invention;

FIG. 14 depicts one embodiment of the logic used during a timer poproutine, to determine whether a compression is to be forced, inaccordance with the principles of the present invention; and

FIGS. 15a-15 b depict examples of a main queue for a System Z, used inaccordance with the principles of the present invention.

BEST MODE FOR CARRYING OUT THE INVENTION

In accordance with the principles of the present invention, thefrequency at which a multisystem log stream is compressed by aparticular system of a multisystem environment is adjusted, inreal-time. The adjustment depends on how frequently other systems of themultisystem environment are compressing the multisystem log stream.

One example of a multisystem environment incorporating and using thecompression pacing capability of the present invention is depicted inFIG. 1. Multisystem environment 100 includes one or more systems 102coupled to a coupling facility 104. Each system 102 is based on theEnterprise Systems Architecture (ESA)/390 offered by InternationalBusiness Machines Corporation, and includes an operating system 106 andone or more resource managers 108, each of which is described below.

In one embodiment, operating system 106 is the Multiple Virtual Storage(MVS) operating system (or the OS/390 operating system) offered byInternational Business Machines Corporation. Operating system 106includes, for instance, a system logger component 110 and a sync pointmanager 112.

System logger component 110, which runs in its own address space startedby the operating system, is involved in the compressing of log streams,as described below. One embodiment of a system logger is described inMVS Programming Assembler Services Reference, IBM Publication No.GC28-1910-01 (September 1996); and MVS Programming Assembler ServicesGuide, IBM Publication No. GC28-1762-01 (September 1996), each of whichis hereby incorporated herein by reference in its entirety.

Sync point manager 112 coordinates participants (such as resourcemanagers) in a 2-phase commit protocol. One example of a sync pointmanager is a Resource Recovery Service, which is offered byInternational Business Machines Corporation and is described in MVSProgramming: Resource Recovery, IBM Publication No. GC28-1739-03(September 1998), which is hereby incorporated herein by reference inits entirety. The sync point manager is involved in the compressionpacing technique of the present invention, as described below.

Each of resource managers 108 owns and controls a set of resourceswithin the computer system. For example, a resource manager can be adatabase management facility, such as IMS or DB2, which is offered byInternational Business Machines Corporation.

As mentioned above, each system 102 is coupled to coupling facility 104.Coupling facility 104 (a.k.a., a structured-external storageprocessor(SES)) is a shareable facility that contains storage accessibleby the systems and performs operations requested by the resourcemanagers and/or programs running within the systems. Examples of acoupling facility are described in detail in U.S. Pat. No. 5,317,739,entitled “Method and Apparatus for Coupling Data Processing Systems,” byElko et al., issued May 31, 1994, and in U.S. patent application Ser.No. 08/632,683 entitled, “Method And System For Log Management In ACoupled Data Processing System,” by Geiner et al., filed on Apr. 15,1996, both assigned to International Business Machines Corporation, andeach of which is hereby incorporated herein by reference in itsentirety.

Coupling facility 104 includes, for instance, one or more scratch pads114 and one or more log streams 116. Each scratch pad 114 may containdata used by the present invention, as described further below, and inone example, is created by the first system logger that attempts to readthe scratch pad. As one example, each log stream has an associatedscratch pad.

Each log stream 116 is accessible by one or more of the systems of themultisystem environment and is capable of containing one or more entriesfor the systems. For each log stream, at least a portion of the logstream can be stored in one or more storage devices (e.g., direct accessstorage device (DASD)), when, for example, sufficient space for the logstream no longer exists within the coupling facility.

One example of a log stream is described in detail with reference toFIG. 2. Log stream 200, referred to herein as a primary log stream,includes information about the transactions processing on the systems,as well as the resource managers involved in those transactions. Theinformation is written to the primary log stream by, for instance, thesystem loggers upon direction from the sync point managers.

In one embodiment, primary log stream 200 includes a number of logblocks or log entries 202, each including various data, such as atransaction identifier, the state of the transaction (e.g., committed,back-out), the set of resource managers associated with the transactionidentified by the transaction id, and the name of the system that ownsthe entry (i.e., the system that wrote the data to the primary logstream). Each log entry has a block id 204, which represents, forinstance, a relative offset into the log stream. In one example, thesmaller the block id, the older the data.

One end of the primary log stream is referred to herein as the tail orrear of the log stream. In one embodiment, the rear of the log streamtypically includes the oldest entry of the log stream (i.e., the entrywith the smallest block id). The other end of the log stream is referredto herein as the head, which is forward from the tail or rear. (Inanother embodiment, it may be the head instead of the tail, whichtypically holds the oldest entry.)

Primary log stream 200 may have additional data, which need not bedescribed for the present invention. The primary log stream is only oneexample of a log stream managed by the present invention. Other logstreams can also be managed by the techniques of the present invention.Further, in another embodiment of the invention, the log streams are notincluded in a coupling facility, but are instead stored in sharedstorage, such as, for instance, shared external storage devices (e.g.,DASD).

Entries are added to log stream 200 by the systems connected to the logstream. (One embodiment for connecting to a log stream is described indetail in U.S. patent application Ser. No. 08/827,214, entitled “TailCompression Of A Sparse Log Stream Of A Multisystem Environment”, filedon Mar. 28, 1997, which is hereby incorporated herein by reference inits entirety.) For example, data is written to a log stream by one ormore system loggers under direction of one or more of the sync pointmanagers. In particular, the sync point managers request that the databe written to the log stream for one or more of the resource managers.

One embodiment of adding entries to a log stream is described in detailin U.S. patent application Ser. No. 08/827,292, entitled “TailCompression Of A Sparse Log Stream Of A Computer System,” by Clark etal., and in U.S. patent application Ser. No. 08/827,558, entitled“System Of Compressing The Tail Of A Sparse Log Stream Of A ComputerSystem,” by Clark et al., (Docket No. PO9-97-021), each of which ishereby incorporated herein by reference in its entirety.

One example of adding entries to log stream 200 is also described indetail with reference to FIG. 3. In the one illustrative exampledescribed below, the sync point manager of a system (e.g., System X)requests data to be written by the system logger to primary log stream200. This sync point manager is referred to herein as Sync Point ManagerX. The same logic is used, however, by the other sync point managers (orany other components or entities) that wish to write information to thelog stream.

Referring to FIG. 3, initially, a shared serialization resource (e.g.,an MVS/ESA shared latch) is obtained for a main queue located withinSystem X, STEP 300. The shared latch allows multiple entities, if any,to concurrently access the queue. The main queue is used to holdelements representative of entries within the primary log stream. Oneexample of a main queue 400 is depicted in FIG. 4.

Main queue 400 is located, in one example, within the storage of SystemX. Each system that writes to the log stream has its own main queue. Inone instance, main queue 400 includes one or more elements 402. Eachelement includes a representation of an entry written onto the primarylog stream. For instance, each element includes the block id of thecorresponding log stream entry, and a logical deletion flag (LDF), whichis described below. In this example, the data for the entry is notmaintained within the queue, but stored separately in, for instance,main store, a cache, auxiliary storage, external storage devices, acoupling facility or any combination thereof. Thus, each element alsoincludes a pointer (PTR) to the corresponding data for the entryrepresented by the element.

Returning to FIG. 3, subsequent to obtaining the latch, a new entry isadded to the log stream and given a block id, STEP 302. In one example,the entry is written to the head of the log stream, and system logger110 ensures that the block id is greater than the block ids alreadyassigned by any of the systems.

Thereafter, a new element, referred to as an LGB, is inserted onto mainqueue 400 of System X in order of the block id, STEP 304. In oneexample, the highest block id is at the top of the queue. In particular,the element is enqueued using compare and swap logic. This providesserialization for the queue, such that multiple updates to the queue arenot occurring at the same time.

Subsequently, the latch is released, STEP 306, and the addition processby System X is complete.

When an entry on the log stream is no longer needed (e.g., its retentionrequirements have been met), then the entry is logically deleted. Inparticular, the entry physically remains on the log stream, but an LGBassociated with the entry is marked as logically deleted.

One embodiment of logically deleting entries is described in detail inU.S. patent application Ser. No. 08/827,292, entitled “Tail CompressionOf A Sparse Log Stream Of A Computer System,” by Clark et al., and inU.S. patent application Ser. No. 08/827,558, entitled “System OfCompressing The Tail Of A Sparse Log Stream Of A Computer System,” byClark et al., each of which is hereby incorporated herein by referencein its entirety.

One example of logically deleting an entry of the log stream is alsodescribed in detail with reference to FIG. 5. In the one illustrativeexample described below, it is Sync Point Manager X that is logicallydeleting an entry from primary log stream 200. The same logic is used,however, by the other sync point managers (or other components orentities) that wish to logically delete information from a log stream.

Referring to FIG. 5, initially, the logical deletion flag for the entryto be deleted is set in the main queue corresponding to System X, STEP500. This flag indicates that the entry is no longer needed (i.e., it isinactive) and can be physically removed from the log stream at theappropriate time.

Subsequently, a count of logically deleted elements for System X isincremented by one, STEP 502. This count is maintained, for instance,within the storage of System X; however, it also can be maintainedwithin the coupling facility or on external storage devices, as otherexamples.

Next, a determination is made as to whether the count has exceeded apredetermined maximum value (e.g., 100 logical deletes), STEP 504. Ifthe count has not exceeded its limit, then the logical deletionprocedure is complete, STEP 506. However, if the count has exceeded thelimit, then log stream 200 is compressed, STEP 508.

One embodiment of compressing a log stream is described in detail inU.S. patent application Ser. No. 08/827,292, entitled “Tail CompressionOf A Sparse Log Stream Of A Computer System,” by Clark et al., filed onMar. 28, 1997, and in U.S. patent application Ser. No. 08/827,558,entitled “System Of Compressing The Tail Of A Sparse Log Stream Of AComputer System,” by Clark et al., filed on Mar. 28, 1997, each of whichis hereby incorporated herein by reference in its entirety.

One example of compressing a log stream by, for instance, the sync pointmanager of System X, is also described in detail with reference to FIG.6. Initially, the latch for the main queue of System X is obtainedexclusively, thereby preventing any other entity within the system fromwriting to the queue, until the latch is released, STEP 600.Additionally, a latch for a compression queue is obtained exclusively.

The compression queue includes entries to be processed during the logstream compression, as described below. In one example, there is acompression queue for each system that can be connected to the logstream. Each compression queue is stored, for instance, in theparticular systems' storage. (In another embodiment, the compressionqueue may be stored in a shared facility, such as the couplingfacility.) The elements of a compression queue have the same format asthe elements of the main queue.

Subsequent to obtaining the exclusive latches, the first element (i.e.,LGB) on the main queue of System X that has been logically deleted islocated, STEP 602. For example, the logical deletion flag for eachelement of the main queue, starting at the last element written to thequeue, is checked until the element having a set flag is found.

Next, the first element on the main queue that has been logicallydeleted, as well as all the other entries which follow it (these entriesare referred to herein as entries of a compressible set or entrieswithin a compression zone) are dequeued from the main queue, STEP 604,and enqueued onto the compression queue, STEP 606.

For example, referring to the illustrations depicted in FIGS. 7a and 7b, if the first element on main queue 400 that is logically deleted(LDF=1) corresponds to block id 005, then block id 005 is removed fromthe main queue and placed on a compression queue 700 for System X, alongwith block ids 004-001.

Returning to FIG. 6, subsequently, the main queue latch is released,STEP 608. Thereafter, the first element on compression queue 700 isdequeued (e.g., block id 001), STEP 610, and a determination is made asto whether that element is logically deleted, INQUIRY 612. If theelement is logically deleted (LDF=1), then that element is freed (e.g.,put on a free queue for reuse by the compression technique), STEP 614.

If, however, the element is not logically deleted (LDF=0), then the mainqueue latch is obtained shared, STEP 616, and the log entrycorresponding to the element is rewritten onto the log stream, STEP 618.For example, the log stream entry having block id 001 has not beenlogically deleted, in this one illustrative example (see the element ofFIG. 7b having block id 001), thus, the log stream entry represented byblock id 001 is rewritten to another location within the log stream. Inparticular, in one example, a copy of the contents of block id 001 isobtained from storage (as indicated by the pointer located in thecompression queue) and placed in an entry at the head of the log stream.That entry is then given a new block id (e.g., block id 007 (see FIG.8)). When an entry is given a new block id, it is considered herein as anew entry, even though the data located in the entry may be older thanthe data of other entries.

Returning to FIG. 6, in addition to the above, the new block id (e.g.,block id 007) is placed in an element, STEP 620, which is inserted ontothe main queue in order of block id, STEP 622.

Subsequent to inserting the element on the main queue or after theelement has been freed, a determination is made as to whether there aremore elements on the compression queue to be processed, INQUIRY 624. Ifthere are more elements, processing continues at STEP 610 “DEQUEUE FIRSTELEMENT ON COMPRESSION QUEUE.” However, if there are no more entries tobe processed, then the compression queue latch is released, STEP 626,and compression is complete.

Referring to FIG. 9, whenever each system performs its compression, STEP900, the system updates a vector, referred to as a last entry vector, inorder to reflect the compression, STEP 902.

One embodiment of a last entry vector is depicted in FIG. 10a. Lastentry vector 1000 includes an entry 1002 for each system that couldpotentially participate in writing entries to the log stream. Forinstance, if the multisystem environment includes three systems, SystemX, System Y and System Z, that could write to the log stream, then therewould be three entries in the vector. Each entry includes the block idof the oldest log entry (e.g., the smallest block id) in the primary logstream needed by the respective system.

For example, if entry 1 of vector 1000 corresponds to System X and theoldest block id System X still needs is 004, then block id 004 is placedin vector entry 1 (see FIG. 10b). Similarly, if entry 3 corresponds toSystem Z and block id 001 is the oldest block id needed by System Z,then block id 001 is place in entry 003. Further, a value of the highestpossible block id (e.g., x′FFFFFFFFFFFFFFFF′) is placed in any vectorentry corresponding to a disconnected system, such as System Y.

As one example, last entry vector 1000 is created within scratch pad 114of coupling facility 104 using a set of services provided by systemlogger 110. In other embodiments, the last entry vector is maintained ona shared external storage device (e.g., DASD) or copies of the vectorare maintained in main storage, a cache, or auxiliary storage of eachsystem. Other examples are also possible and included within the spiritand scope of the present invention.

Returning to STEP 902 of FIG. 9, last entry vector 1000 is updated withthe block id of the oldest entry System X still needs. This isaccomplished, in one example, by using a compare and swap protocol,which ensures that the vector is only changed by one system at a time.The block id to be placed in the entry is the lowest block id in mainqueue 400 of System X that has not been logically deleted.

After updating the vector, a determination is made as to whether thevector entry that it replaced previously contained the lowest block idof the vector, INQUIRY 904. If it did not contain the lowest block id,then no further action is taken. However, if it did contain the lowestblock id, then the sync point manager requests the system logger ofSystem X (in this example) to delete the log tail of all the entrieslower than the new lowest block id in the vector, STEP 906.

For example, assume a log stream has entries written to it by threesystems, System X, System Y and System Z (see FIG. 11a). Further assumethat the oldest entry which System X requires is 001; the oldest entrywhich System Z requires is 004; and that System Y is not active, at thistime (see FIG. 11b). Then, when System X updates the vector with theoldest entry it still needs (e.g., block id 006 of FIG. 11a), asdepicted in FIG. 11c, System X determines if its entry previouslycontained the lowest block id of the vector. In this example, the entrycontained block id 001, which is the lowest. Thus, System X deletes allentries lower than the new lowest block (e.g., block id 004). That is,block ids 003-001 are physically removed from the primary log stream,and block id 004 becomes the new tail of the log stream. This completesthe tail deletion.

The frequency with which a multisystem log stream is compressed bysystems of the multisystem environment impacts system performance. Thus,in accordance with the principles of the present invention, thefrequency at which a particular system of the multisystem environmentcompresses a log stream is based on heuristics. That is, each systemadjusts its compression rate (i.e., the frequency at which itcompresses) in real-time based on the compression rates of the othersystems connected to the log stream. This ensures a minimal sized logstream and increases the likelihood that the log stream is containedsolely within the coupling facility. This, in turn, positively affectssystem performance.

In accordance with the principles of the present invention, in order topace the frequency at which a log stream is compressed by the systems ofthe multisystem environment, a compression vector is used. In oneembodiment, a compression vector 1200 is maintained within scratch pad114 of the coupling facility, as depicted in FIG. 12.

Compression vector 1200 includes a plurality of entries 1202. There isone entry 1202 for each system coupled to the log stream to becompressed. Each entry includes a compress lag count, which is a numberranging in value from zero to 255, as one example. The number is used torepresent each system's compression activity for the log stream relativeto the other systems' compression activity for the log stream. Thus, thecompress lag count does not represent the number of compressions for thelog stream performed by the system associated with that count, butinstead indicates the number of compressions for each system relative tothe number of compressions for the other systems.

The compress lag count(s) get updated when a compression is performed,and one embodiment for updating the compress lag counts is describedwith reference to FIG. 13. The logic of FIG. 13 is performed by, forinstance, the sync point manager of a system that performed acompression. Thus, if System X performed a compression, then sync pointmanager X would perform the update.

Referring to FIG. 13, when a compression is performed by a system (e.g.,System X), an initial determination is made as to whether thecompression was performed because the system detected that a predefinednumber (e.g., 100) of logically deleted entries existed on its mainqueue, STEP 1300. (This type of compression is referred to herein as a“normal compression”, which is described with reference to FIG. 6.)

Should the compression be a normal compression, then the compress lagcount for the system (e.g., System X) is set to zero, STEP 1302, and thecompress lag counts of any other systems coupled to the log stream areincremented by one or set to 255 (whichever is the minimum thereof),STEP 1304. This completes the update.

Returning to INQUIRY 1300, if the compression is not a normalcompression, but instead a forced compression (referred to herein as aCompressAll, which is described below), then the compress lag count ofthe system performing the compression is set to zero, STEP 1306, and theother compress lag counts are not adjusted.

The use of the compress lag counts are further described with referenceto FIG. 14. The logic of FIG. 14 is performed by a sync point manager ofa system coupled to the log stream, when a timer associated with thesystem triggers indicating that a determination should be made as towhether a forced compression should be performed. In particular, when atimer associated with a system pops (i.e., the predetermined timeinterval has elapsed), the compress lag count for that system is checkedto determine if the sync point manager needs to perform a CompressAllfor the log stream in order to allow a tail delete to be performed. If asystem is not performing normal compressions as frequently as othersystems, then the sync point manager detects that a forced compressionis necessary.

Referring to FIG. 14, initially the value of the compress lag count ofthe system associated with the timer pop (e.g., assume System Z in thisone illustrative example) is checked, INQUIRY 1400. If the value of thecompress lag count for System Z is equal to zero indicating that it isperforming normal compressions at least as frequently as the othersystems, then a compress zero count associated with System Z isincremented by one, STEP 1402. The compress zero count is kept in localstorage (i.e., it is not available to other systems) and is used andupdated by the local system (e.g., System Z, in this example). It isused to determine if the predetermined time interval of the timer popshould be adjusted.

Thereafter, the compress zero count is checked to determine if it isgreater than or equal to 2, INQUIRY 1404. Should the compress zero countbe less than two, then no adjustments are made and the timer pop routineis complete. However, should the value of the compress zero count begreater than or equal to two, then the timer is popping too frequently,and as a result, excessive amounts of processing time is being used tocheck whether or not a forced compression (CompressAll) is required.Therefore, the timer interval is increased, STEP 1406. In one example,it is doubled, but it does not go beyond a maximum interval. Thisdecreases the number of times that the timer pops.

In addition to the above, the compress zero count is set to zero, STEP1408, and processing of the timer pop routine is complete.

Returning to INQUIRY 1400, if the value of the compress lag count isgreater than zero indicating that System Z is not compressing frequentlyenough, relative to the other systems coupled to the log stream, thenthe sync point manager of System Z performs a forced compression, STEP1410. In one embodiment, the forced compression includes having all ofthe entries on the main queue of System Z that are not logically deletedrewritten onto the primary log stream and onto the main queue. Forexample, refer to FIG. 15. If System Z has three entries on its mainqueue 1500, including block ids 001-003, and two of those entries havenot been logically deleted, namely block id 001 and block id 003, thenthose two entries are rewritten onto the head of the primary log streamand accordingly, are given new block ids. Assuming that new block id 008corresponds to old block id 001 and new block id 009 corresponds to oldblock id 003, then block id 008 and block id 009 are rewritten onto themain queue of System Z, as illustrated in FIG. 15b. As is shown, blockid 002 is not rewritten onto the main queue or onto the primary logstream, since it is no longer wanted (i.e., it has been logicallydeleted).

Returning to FIG. 14, subsequent to performing the forced compression bySystem Z, a determination is made as to whether the compress lag countof System Z is greater than a selected value, such as two times (thenumber of systems connected to the log stream minus one) (i.e., iscompress lag count ) 2×(#sys−1)). This indicates that System Z has aslower transaction rate than at least one of the other systems coupledto the log stream and is compressing its log stream less frequently. Inorder to account for this difference, the timer pop is adjusted inreal-time in order to cause more frequent compressions. Should thecompress lag count be greater than the selected value, then the timerinterval is decreased, so that it is triggered more frequently, STEP1414. In one example, the timer interval is halved. Thereafter, thecompress zero count for System Z is set to zero, STEP 1408, andprocessing of the timer pop routine is complete.

Returning to INQUIRY 1412, if the compress lag count is not greater thanthe selected value, then there is no need to decrease the timerinterval, at this point. Therefore, the compress zero count for System Zis set to zero, STEP 1408, and processing is complete.

Described above is a capability that provides for the adjusting, inreal-time, of the frequency with which a system compresses a log stream.Compression is performed whenever a system detects that its main queuehas a predefined number of logically deleted entries, such as 100logically deleted entries. Additionally, compression is performed whenthe timer associated with a system has popped and another system hasperformed a compression, but the system of the popped timer has not. Thefrequency with which the timer pops, is also controlled, in accordancewith the principles of the present invention, such that the timer popdoes not use up excessive amounts of processing time.

Each sync point manager performs a compress or a CompressAll at thespeed of the fastest system that is processing an active workload. Forexample, if one system is processing 100 transactions per second and theother two systems coupled to the log stream are processing onetransaction per second, then the other two systems are to issue acompress or a CompressAll at the 100 transactions per second rate. Ifthis is not accomplished, then the log stream will start to grow insize, since the faster system is prevented from issuing tail deletes bythe slower systems.

As described above, a log stream includes one or more datum (e.g., logdata). Thus, other entities that include one or more datum are includedwithin the definition of a log stream. These entities include, but arenot limited to, log files and log data sets.

The multisystem environment described above is only one example. Thepresent invention can be used and/or incorporated within other systemsor environments without departing from the spirit of the presentinvention. For example, different architectures and/or operating systemscan be used without departing from the spirit of the present invention.As another example, one or more central processing complexes are coupledto the coupling facility, and each central processing complex includesone or more central processing units, which executes an operatingsystem. Further, in another embodiment, the computer system can includemultiple coupling facilities. Additionally, the present invention isapplicable to computer systems that do not include a coupling facility.

Further, other components of the system can also have log streamsassociated therewith that can be managed and compressed by the presentinvention without departing from the spirit or scope of the presentinvention.

In yet a further embodiment, the system logger can be a separatecomponent from the operating system. Further, components other than thesystem logger can write to and delete entries from the log stream. Inyet a further embodiment, the sync point manager is not the onlycomponent that can perform compression or pace the compression. Inanother embodiment, other components of the system perform thecompression and/or pacing techniques, including, but not limited to, theresource managers. Again, the multisystem environment described hereinis only one example.

The present invention can be included in an article of manufacture(e.g., one or more computer program products) having, for instance,computer usable media. The media has embodied therein, for instance,computer readable program code means for providing and facilitating thecapabilities of the present invention. The article of manufacture can beincluded as a part of a computer system or sold separately.

The flow diagrams depicted herein are just exemplary. There may be manyvariations to these diagrams or the steps (or operations) describedtherein without departing from the spirit of the invention. Forinstance, the steps may be performed in a differing order, or steps maybe added, deleted or modified. All of these variations are considered apart of the claimed invention.

Although preferred embodiments have been depicted and described indetail herein, it will be apparent to those skilled in the relevant artthat various modifications, additions, substitutions and the like can bemade without departing from the spirit of the invention and these aretherefore considered to be within the scope of the invention as definedin the following claims.

What is claimed is:
 1. An article of manufacture, comprising: at leastone computer usable medium having computer readable program code meansembodied therein for causing the pacing of the frequency at whichmultisystem log streams are compressed, the computer readable programcode means in said article of manufacture comprising: computer readableprogram code means for causing a computer to ascertain a rate at which amultisystem log stream is compressed by one system of a multisystemenvironment, said rate being relative to how frequently said multisystemlog stream is compressed by at least one other system of saidmultisystem environment; and computer readable program code means forcausing a computer to adjust, in real-time, the frequency at which saidone system compresses said multisystem log stream.
 2. The article ofmanufacture of claim 1, wherein said computer readable program codemeans for causing a computer to ascertain comprises computer readableprogram code means for causing a computer to check a compress lag countof said one system, said compress lag count representing the rate atwhich said one system is compressing said multisystem log streamrelative to how frequently said multisystem log stream is compressed bysaid at least one other system.
 3. The article of manufacture of claim2, further comprising computer readable program code means for causing acomputer to update said compress lag count when said one systemcompresses said multisystem log stream.
 4. The article of manufacture ofclaim 3, further comprising computer readable program code means forcausing a computer to set at least one other compress lag count of saidat least one other system, when said one system compresses saidmultisystem log stream.
 5. The article of manufacture of claim 1,wherein said computer readable program code means for causing a computerto adjust comprises computer readable program code means for causing acomputer to increase the frequency at which said one system compressessaid multisystem log stream, when said ascertained rate indicates thatsaid one system is compressing said multisystem log stream at a slowerrate than said at least one other system.
 6. The article of manufactureof claim 5, wherein said computer readable program code means forcausing a computer to increase comprises computer readable program codemeans for causing a computer to force a compression to be performed bysaid one system.
 7. The article of manufacture of claim 5, furthercomprising computer readable program code means for causing a computerto determine, at predefined time intervals, whether said ascertainedrate is indicating that the frequency at which said one systemcompresses is to be increased.
 8. The article of manufacture of claim 7,further comprising computer readable program code means for causing acomputer to decrease the time of said predefined time intervals, when itis determined that the ascertained rate of said one system has apredetermined relationship with a selected value.
 9. The article ofmanufacture of claim 8, wherein said computer readable program codemeans for causing a computer to decrease comprises computer readableprogram code means for causing a computer to decrease by half the timeof said predefined time intervals, when it is determined that theascertained rate is greater than two times (a number of systems coupledto said multisystem log stream minus one).
 10. The article ofmanufacture of claim 1, further comprising computer readable programcode means for causing a computer to compare, at predefined timeintervals, said ascertained rate to a predefined value to determinewhether the frequency at which said one system compresses is to beadjusted.
 11. The article of manufacture of claim 10, wherein saidcomputer readable program code means for causing a computer to adjustperforms the adjusting, when said ascertained rate has a predefinedrelationship with said predefined value.
 12. The article of manufactureof claim 10, further comprising computer readable program code means forcausing a computer to decrease the time of said predefined timeintervals, when it is determined that the ascertained rate of said onesystem has a predetermined relationship with a selected value.
 13. Thearticle of manufacture of claim 10, further comprising computer readableprogram code means for causing a computer to increase the time of saidpredefined time intervals, when it is determined that said comparing isto be performed less frequently.
 14. The article of manufacture of claim1, wherein said multisystem log stream is at least partially locatedwithin a coupling facility, said coupling facility being coupled to saidone system and said at least one other system of said multisystemenvironment.
 15. At least one program storage device readable by amachine, tangibly embodying at least one program of instructionsexecutable by the machine to perform a method of pacing the frequency atwhich multisystem log streams are compressed, said method comprising:ascertaining a rate at which a multisystem log stream is compressed byone system of a multisystem environment, said rate being relative to howfrequently said multisystem log stream is compressed by at least oneother system of said multisystem environment; comparing, at predefinedtime intervals, said ascertained rate to a predefined value to determinewhether the frequency at which said one system compresses saidmultisystem log stream is to be adjusted; adjusting, in real-time, thefrequency at which said one system compresses said multisystem logstream, when said comparing indicates adjusting; determining whether thetime of said predefined time intervals is to be modified; and modifyingthe time of said predefined time intervals to adjust how often saidcomparing is performed, when it is determined that the time is to bemodified.
 16. The at least one program storage device of claim 15,wherein said comparing indicates that the frequency of compression bysaid one system is to be increased.
 17. The at least one program storagedevice of claim 16, wherein said determining indicates the time is to bedecreased, wherein said comparing is performed more frequently.
 18. Theat least one program storage device of claim 15, wherein saiddetermining indicates the time is to be increased, wherein saidcomparing is performed less frequently.